Staged Translation of Graph Transformation Rules
نویسندگان
چکیده
Graph transformation rules provide an opportunity to specify model transformations in a declarative way at a high level of abstraction. So far, compilers have translated graph transformation rules into conventional programming languages such as Java, C, or C#. In contrast, we follow a staged translation approach: We developed a compiler which translates graph transformation rules into a procedural language for behavioral modeling (Xcore). By reusing the Xcore compiler, the code may be compiled down to a conventional programming language in a second step. The generated Xcore code is significantly more concise and readable than programming language code. Furthermore, the code is portable since it is completely programming language independent.
منابع مشابه
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavi...
متن کاملVisual Modeling and Analysis of EMF Model Transformations Based on Triple Graph Grammars
The tool HENSHIN is an Eclipse plug-in supporting visual modeling and execution of rule-based EMF model transformations. This paper describes the recent extensions of HENSHIN by a visual editor for triple graph grammars (TGGs). The visual editor (called HENSHINTGG) supports a compact visualization of triple rules in an integrated editor panel. Internally, triple graph rules are represented as H...
متن کاملConfluence of Typed Attributed Graph Transformation Systems
The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In thi...
متن کاملForschungsberichte der Fakultät IV – Elektrotechnik und Informatik Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars - Extended Version
Triple Graph Grammars (TGGs) are a well-established concept for the speci cation of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour especially local con uence is missing up to now. In order to close this gap we generate forward translation rules, w...
متن کاملExtending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a static checking algorithm for proving the shape safety of graph transformation rules modelling operations on pointer structures. In this paper, we outline how to apply this approach to the C programming language. We exte...
متن کامل